This will most likely involve an existing pattern as a candidate solution to provide the appropriate decoupling. 这将很可能涉及到将现有模式作为候选解决方案来提供恰当的分离。
I don't think that any candidate has a magic bullet or a bandage solution that's going to solve the entire problem. 我不认为有哪个候选人能彻底解决整个问题。
Then given some good candidate solution, we might then iterate to improve a candidate solution. 然后给出一些好的候选方案,可能而后我们在迭代中改进某个候选方案。
Each particle represented as a binary vector corresponds to a candidate solution to the polygonal approximation problem. 每个粒子作为一个二进制向量,一个备选项,以对应多边形逼近。
Then a candidate solution is obtained by using high contact principle to solve a free bounded problem, and it is the optimal solution which is verified by optimal stopping theory. 建立了问题的最优停止模型,利用高切原理求解一个自由边界问题,得到候选解,运用最优停止理论验证了其的确为最优解,显式地给出最优投资时点并进行了比较静态分析。
This paper encodes the candidate solution using molecular beacons. In this method, it solves the MAX-SAT problem while solving SAT problem. 文章采用分子信标编码方法,在解决SAT问题的同时解决MAX-SAT问题。
In the construction phase, the improved line integrated validity index is introduced as the greedy function, and a restricted candidate list ( RCL) is constructed by rule of proportion, from which elements are randomly chosen to form a feasible solution. 在构造阶段,以改进线路综合有效性指标为贪婪函数,采用比例法形成限制候选列表,并随机选择元素构成可行方案。
The paper shows that the modified immune clone diversity algorithm can optimize the complex functions by using fewer candidate solution colonies. 文章还对算法的复杂性进行了分析,证明了改进免疫系统克隆多样性算法可以利用相对小的候选解群体解决复杂函数优化问题。
The algorithm proposed defines max-min distance density and gives a Pareto candidate solution set maintenance method, ensuring the diversity of the Pareto solution set. 新算法定义了极大极小距离密度,给出了基于极大极小距离密度的Pareto候选解集的维护方法,保证了非劣解集的多样性。
Traditionally, solutions to optimization problems are often using either problem-specific heuristics or variants of the local-search method that iteratively refines a single candidate solution to the problem. 常规的优化问题通常采用局部搜索方法,它们有一个共同的特点就是通过迭代来提高问题域中唯一的候选解。
An improved algorithm that is based on signal and the candidate nodes sorted is proposed, and the experiment results prove that the improved algorithm can reduce computation complexity and store space, also can accelerate the rate of converging to the maximum likelihood solution. 仿真结果表明,分枝定界算法是一种最大似然检测算法,提出的改进算法加快了收敛速度,降低了计算复杂度和对存储空间的要求,从而证明了改进算法的有效性。
A standard particle swarm optimization includes a swarm of particles. Each particle represents a candidate solution of the problem. 标准的微粒算法中包含一群粒子,每个粒子代表问题的一个候选解。
In SOA, optimization is viewed as a search of search population in the search space. After the detailed study of human searching behaviors, SOA is established with search group as population and the position of a seeker as a candidate solution. 对人类搜索行为进行深入研究,将优化视为搜寻队伍在搜索空间对最优解的搜索,以搜寻队伍为种群,以搜寻者所处位置为优化问题的候选解,提出了SOA。
Particle Swarm Optimization system simulates the knowledge evolvement of a social organism. In this system, every particle represents a candidate solution to the problem at hand. The particles fly through a multidimensional search space to find out the optima or sub-optima. 粒子群系统模拟社会机制的进化过程,在这个系统里,代表潜在解的粒子个体在一个多维空间里飞行以此来找到更优的或者最优的解。
On the other hand, the preservation method for Pareto candidate solution set based on NFC is incorporated into the proposed algorithm. This method can maintain the diversity of Pareto candidate set effectively. 此外,融入了一种基于近邻函数准则的Pareto候选集的维护方法,使用这种方法可以有效地维护候选解集中个体的多样性。
A candidate neighboring solution is produced in all neighboring solutions before searching local optimal solution, then, the local optimal solution is found out from this candidate neighboring solution. 在搜索局部最优解之前从全部邻域解中产生出一个候选的邻域解,在这个候选的邻域解中搜索局部最优解。